Brownian Slow Points: The Critical Case

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multiple points of the Brownian sheet in critical dimensions

It is well-known that an N -parameter d-dimensional Brownian sheet has no k-multiple points when (k − 1)d > 2kN , and does have such points when (k− 1)d < 2kN . We complete the study of the existence of k-multiple points by showing that in the critical cases where (k − 1)d = 2kN , there are a.s. no k-multiple points. Abbreviated title: Multiple points of the Brownian sheet

متن کامل

Monodromy problem for the degenerate critical points

For the polynomial planar vector fields with a hyperbolic or nilpotent critical point at the origin, the monodromy problem has been solved, but for the strongly degenerate critical points this problem is still open. When the critical point is monodromic, the stability problem or the center- focus problem is an open problem too. In this paper we will consider the polynomial planar vector fields ...

متن کامل

Slow kinetics of Brownian maxima.

We study extreme-value statistics of Brownian trajectories in one dimension. We define the maximum as the largest position to date and compare maxima of two particles undergoing independent Brownian motion. We focus on the probability P(t) that the two maxima remain ordered up to time t and find the algebraic decay P ∼ t(-β) with exponent β = 1/4. When the two particles have diffusion constants...

متن کامل

Cut Points on Brownian Paths

Let X be a standard 2-dimensional Brownian motion. There exists a.s. t ∈ (0, 1) such that X([0, t)) ∩ X((t, 1]) = ∅. It follows that X([0, 1]) is not homeomorphic to the Sierpiński carpet a.s.

متن کامل

Special points of the Brownian net

The Brownian net, which has recently been introduced by Sun and Swart [SS08], and independently by Newman, Ravishankar and Schertzer [NRS08], generalizes the Brownian web by allowing branching. In this paper, we study the structure of the Brownian net in more detail. In particular, we give an almost sure classification of each point in R according to the configuration of the Brownian net paths ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Annals of Probability

سال: 1985

ISSN: 0091-1798

DOI: 10.1214/aop/1176992908